Tightness bounds for strongly mixing random sequences
نویسندگان
چکیده
منابع مشابه
Tightness in subset bounds for coherent configurations
Association schemes have many applications to the study of designs, codes and geometries, and are well-studied. Coherent configurations are a natural generalization of association schemes, however, analogous applications have yet to be fully explored. Recently, Hobart [Michigan Math. J. 58 (2009), 231–239] generalized the linear programming bound for association schemes, showing that a subset Y...
متن کاملMixing property and pseudo random sequences
We will give a summary about the relations between the spectra of the Perron–Frobenius operator and pseudo random sequences for 1-dimensional cases. There are many difficulties to construct general theory of higher-dimensional cases. We will give several examples for these cases.
متن کاملThe Convergence Theorems for Mixing Random Variable Sequences
B R . c o v ( ( , ) , ( , )) 0 i j f X i A g X j B , whenever the covariance exists. An infinite family of random variables {X ,1 } i i is said to be NA if every finite subfamily is NA. Definition 2. A finite family of random variables {X ,1 } i i n is said to be -mixing if for any finite subsets , S T N , ( ) su p { ( , ); ( , ) } 0 , s S T d is t S T s s ...
متن کاملExponential Bounds and Tails for Additive Random Recursive Sequences
Exponential bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We derive tail bounds from estimates of the Laplace transforms and of the moment sequences. For the proof we use some clas...
متن کاملRapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences
We show that the switch Markov chain for sampling simple undirected, as well as bipartite, graphs with a given degree sequence is rapidly mixing when the degree sequence is strongly stable. Strong stability is closely related to the notion of P-stability introduced by Jerrum and Sinclair (1990), and is satisfied by all degree sequences for which the switch chain is known to be rapidly mixing ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1999
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-99-05404-0